Simplicial Homology for Future Cellular Networks

Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes

Optimal transient growth in an incompressible flow past a backward-slanted step

With the aim of providing a first step in the quest for a reduction of the aerodynamic drag on the rear-end of a car, we study the phenomena of separation and reattachment of an incompressible flow focusing on a specific aerodynamic geometry, namely a backward-slanted step at 25 degrees of inclination. The ensuing recirculation bubble provides the basis for an analytical and numerical investigation of streamwise-streak generation, lift-up effect, and turbulent-wake and Kelvin-Helmholtz instabilities. A linear stability analysis is performed, and an optimal control problem with a steady volumic forcing is tackled by means of variational formulation, adjoint method, penalization scheme and orthogonalization algorithm. Dealing with the transient growth of spanwise-periodic perturbations and inspired by the need of physically-realizable disturbances, we finally provide a procedure attaining a kinetic-energy maximal gain of the order of one million with respect to the power introduced by the external forcing.Comment: 17 figure

Homology-based Distributed Coverage Hole Detection in Wireless Sensor Networks

Homology theory provides new and powerful solutions to address the coverage problems in wireless sensor networks (WSNs). They are based on algebraic objects, such as Cech complex and Rips complex. Cech complex gives accurate information about coverage quality but requires a precise knowledge of the relative locations of nodes. This assumption is rather strong and hard to implement in practical deployments. Rips complex provides an approximation of Cech complex. It is easier to build and does not require any knowledge of nodes location. This simplicity is at the expense of accuracy. Rips complex can not always detect all coverage holes. It is then necessary to evaluate its accuracy. This work proposes to use the proportion of the area of undiscovered coverage holes as performance criteria. Investigations show that it depends on the ratio between communication and sensing radii of a sensor. Closed-form expressions for lower and upper bounds of the accuracy are also derived. For those coverage holes which can be discovered by Rips complex, a homology-based distributed algorithm is proposed to detect them. Simulation results are consistent with the proposed analytical lower bound, with a maximum difference of 0.5%. Upper bound performance depends on the ratio of communication and sensing radii. Simulations also show that the algorithm can localize about 99% coverage holes in about 99% cases

Construction of the generalized Cech complex

In this paper, we introduce an algorithm which constructs the generalized Cech complex. The generalized Cech complex represents the topology of a wireless network whose cells are different in size. This complex is often used in many application to locate the boundary holes or to save energy consumption in wireless networks. The complexity of a construction of the Cech complex to analyze the coverage structure is found to be a polynomial time

Analysis of Static Cellular Cooperation between Mutually Nearest Neighboring Nodes

Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical limitations. Instead, cooperation groups can be predefined and static, with nodes linked by fixed infrastructure. To analyze such a potential network, we propose a grouping method based on node proximity. With the Mutually Nearest Neighbour Relation, we allow the formation of singles and pairs of nodes. Given an initial topology for the stations, two new point processes are defined, one for the singles and one for the pairs. We derive structural characteristics for these processes and analyse the resulting interference fields. When the node positions follow a Poisson Point Process (PPP) the processes of singles and pairs are not Poisson. However, the performance of the original model can be approximated by the superposition of two PPPs. This allows the derivation of exact expressions for the coverage probability. Numerical evaluation shows coverage gains from different signal cooperation that can reach up to 15% compared to the standard noncooperative coverage. The analysis is general and can be applied to any type of cooperation in pairs of transmitting nodes.Comment: 17 pages, double column, Appendices A-D, 9 Figures, 18 total subfigures. arXiv admin note: text overlap with arXiv:1604.0464

Numerical study of substrate assimilation by a microorganism exposed to fluctuating concentration

In most modelling works on bioreactors, the substrate assimilation is computed from the volume average concentration. The possible occurrence of a competition between the transport of substrate towards the cell and the assimilation at the cell level is generally overlooked. In order to examine the consequences of such a competition, a diffusion equation for the substrate is coupled with a specific boundary condition defining the up take rate at the cell liquid interface. Two assimilation laws are investigated, whereas the concentration far from the cell is varied in order to mimic concentration fluctuations. Both steady and unsteady conditions are investigated. The actual uptake rate computed from the interfacial concentration is compared to the time-averaged uptake rate based on the mean far-field concentration. Whatever the assimilation law, it is found that the uptake rate can be correlated to the mean far-field concentration, but the actual values of the parameters are affected in case of transport limitation. Moreover, the structure of the far-field signal influences the substrate assimilation by the microorganism, and the mean interfacial uptake rate depends on the ratio between the characteristic time of the signal and the diffusional time scale, as well as on the amplitude of the fluctuations around the mean far-field concentration in substrate. The present work enlightens some experimental results and helps in understanding the differences between the concentration measured and that present in the microenvironment of the cells